|
|
Methods of Static Buckling Analysis
Svoboda, Filip ; Eliáš, Jan (referee) ; Frantík, Petr (advisor)
The aim of this theses is to create application, which is able to calculate buckling load of structure made from 1D bar elements, using finite element method. introduction is devoted to basic principles of buckling and derivation of necessary formulas. Then are described all operations and numerical methods needed for the application. At the and is in detail analyzed few structures and results are compared with known solutions or with other applications.
|
|
| |
|
|
Eigenvalue Problem and Applications
Machát, Ondřej ; Čermák, Libor (referee) ; Knotek, Stanislav (advisor)
This thesis contains definition and overview of the properties of eigenvalues´ problems including its generalised alternate and the problem of eigenvalues in differential equations. Several numerical methods of calculations are also listed here. Crux of the thesis are the practical applications of this mathematical domain in use. The reader is progressively going to meet the model of the forging hammer´s procedure, tasks looking for critical load pressure needed to irreversible bending of the imbedded girder. In conclusion the thesis will also deal with the stability of the liquid flowing.
|
|
|
Multipoint identification of position and orientation of object
Řičánek, Dominik ; Ligocki, Adam (referee) ; Burian, František (advisor)
The goal of this paper is to find a good method to determine the pose of two, mutually rotated, objects and to try and implement it first in C++ without the usage of any external libraries and then in Kuka Robot Language (KRL). First we are going to look at two different approaches to solving this problem: The Iterative Closest Point algorithm (ICP) and the Kabsch Algorithm. From them one is going to be chosen and a program will be build around it. Following its implementation, the algorithm’s precision is going to be tested. Finally KRL will be briefly introduced and the various problems involving transition of the algorithm from C++ to KRL will be talked about.
|
|
|
Sturm-Liouville problem in vibration of continuous systems
Varmusová, Alanis ; Nechvátal, Luděk (referee) ; Šremr, Jiří (advisor)
The goal of this thesis is to compile the theory concerning the Sturm-Liouville problem and partial diferential equations of the second order. Based on the findings the necessary eigenvalues, eigenfunctions and Green's functions, which are connected with the Sturm-Liouville problem, are derived in the thesis. Results of derivation are used in the solution of the initial-boundary value problem for wave equation, which results are then interpreted graphically.
|
|
|
Development of algorithms for digital real time image processing on a DSP Processor
Knapo, Peter ; Sajdl, Ondřej (referee) ; Belgium, Jurgen Baert (MSc), KHBO (advisor)
Rozpoznávanie tvárí je komplexný proces, ktorého hlavným ciežom je rozpoznanie žudskej tváre v obrázku alebo vo video sekvencii. Najčastejšími aplikáciami sú sledovacie a identifikačné systémy. Taktiež je rozpoznávanie tvárí dôležité vo výskume počítačového videnia a umelej inteligencií. Systémy rozpoznávania tvárí sú často založené na analýze obrazu alebo na neurónových sieťach. Táto práca sa zaoberá implementáciou algoritmu založeného na takzvaných „Eigenfaces“ tvárach. „Eigenfaces“ tváre sú výsledkom Analýzy hlavných komponent (Principal Component Analysis - PCA), ktorá extrahuje najdôležitejšie tvárové črty z originálneho obrázku. Táto metóda je založená na riešení lineárnej maticovej rovnice, kde zo známej kovariančnej matice sa počítajú takzvané „eigenvalues“ a „eigenvectors“, v preklade vlastné hodnoty a vlastné vektory. Tvár, ktorá má byť rozpoznaná, sa premietne do takzvaného „eigenspace“ (priestor vlastných hodnôt). Vlastné rozpoznanie je na základe porovnania takýchto tvárí s existujúcou databázou tvárí, ktorá je premietnutá do rovnakého „eigenspace“. Pred procesom rozpoznávania tvárí, musí byť tvár lokalizovaná v obrázku a upravená (normalizácia, kompenzácia svetelných podmienok a odstránenie šumu). Existuje mnoho algoritmov na lokalizáciu tváre, ale v tejto práci je použitý algoritmus lokalizácie tváre na základe farby žudskej pokožky, ktorý je rýchly a postačujúci pre túto aplikáciu. Algoritmy rozpoznávania tváre a lokalizácie tváre sú implementované do DSP procesoru Blackfin ADSP-BF561 od Analog Devices.
|
|
| |
|
|
Mathematical methods in some ranking models
Pažourek, Lubomír ; Kureš, Miroslav (referee) ; Čermák, Jan (advisor)
The bachelor thesis deals with the mathematical essence of some ranking methods. Their unifying element is the so-called Perron-Frobenius theorem for non-negative and irreducible matrices, which formulates the conditions for the existence of a positive eigenvalue and a positive eigenvector of the given matrix. The goal of the thesis consists in providing an overview of the necessary theoretical results, explaining their application within some ranking methods and performing simulations during the evaluation of some competitions.
|
|
|
Sturm-Liouville problem in vibration of continuous systems
Varmusová, Alanis ; Nechvátal, Luděk (referee) ; Šremr, Jiří (advisor)
The goal of this thesis is to compile the theory concerning the Sturm-Liouville problem and partial diferential equations of the second order. Based on the findings the necessary eigenvalues, eigenfunctions and Green's functions, which are connected with the Sturm-Liouville problem, are derived in the thesis. Results of derivation are used in the solution of the initial-boundary value problem for wave equation, which results are then interpreted graphically.
|
|
|
Multipoint identification of position and orientation of object
Řičánek, Dominik ; Ligocki, Adam (referee) ; Burian, František (advisor)
The goal of this paper is to find a good method to determine the pose of two, mutually rotated, objects and to try and implement it first in C++ without the usage of any external libraries and then in Kuka Robot Language (KRL). First we are going to look at two different approaches to solving this problem: The Iterative Closest Point algorithm (ICP) and the Kabsch Algorithm. From them one is going to be chosen and a program will be build around it. Following its implementation, the algorithm’s precision is going to be tested. Finally KRL will be briefly introduced and the various problems involving transition of the algorithm from C++ to KRL will be talked about.
|
guest ::
